A Novel Greedy Computing Algorithm for Rectangle Packing Problems

Rectangle packing problem often appears in encasement and cutting as well as layout of homepage or newspaper, etc. This problem has been shown to be NP hard. For solving this problem, many compute algorithms based on different strategies are presented in the literatures. A novel-computing algorithm is proposed in this paper. The novel match algorithm tested the instances that taken from the literatures. The computational results demonstrate that the novel algorithm is rather optimal and efficient for solving rectangle block packing problem.